Small Gaps between Primes or Almost Primes
نویسندگان
چکیده
Let pn denote the nth prime. Goldston, Pintz, and Yıldırım recently proved that lim inf n→∞ (pn+1 − pn) log pn = 0. We give an alternative proof of this result. We also prove some corresponding results for numbers with two prime factors. Let qn denote the nth number that is a product of exactly two distinct primes. We prove that lim inf n→∞ (qn+1 − qn) ≤ 26. If an appropriate generalization of the Elliott-Halberstam Conjecture is true, then the above bound can be improved to 6.
منابع مشابه
Small Gaps between Primes I
Finding mathematical proofs for easily observed properties of the distribution of prime numbers is a difficult and often humbling task, at least for the authors of this paper. The twin prime conjecture is a famous example of this, but we are concerned here with the much more modest problem of proving that there are arbitrarily large primes that are “unusually close ” together. Statistically thi...
متن کاملSmall Gaps between Primes: the Gpy Method and Recent Advancements over It
In the works with D. A. Goldston and J. Pintz (GPY), the use of short divisor sums has led to strong results concerning the existence of small gaps between primes. The results depend on the information about the distribution of primes in arithmetic progressions, specifically on the range where the estimate of the Bombieri-Vinogradov Theorem is taken to hold. Let pn denote the n-th prime. We obt...
متن کاملBounded Gaps between Primes in Multidimensional Hecke Equidistribution Problems
Using Duke’s large sieve inequality for Hecke Grössencharaktere and the new sieve methods of Maynard and Tao, we prove a general result on gaps between primes in the context of multidimensional Hecke equidistribution. As an application, for any fixed 0 < < 12 , we prove the existence of infinitely many bounded gaps between primes of the form p = a + b such that |a| < √p. Furthermore, for certai...
متن کاملHigher Correlations of Divisor Sums Related to Primes Iii: Small Gaps between Primes
We use divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that, for any η > 0, a positive proportion of consecutive primes are within 4 + η times the average spacing between primes. Authors’ note. This paper was written in 2004, prior to the solution, in [8], of the problem considered ...
متن کاملExpander Graphs and Gaps between Primes∗
The explicit construction of infinite families of d-regular graphs which are Ramanujan is known only in the case d−1 is a prime power. In this paper, we consider the case when d− 1 is not a prime power. The main result is that by perturbing known Ramanujan graphs and using results about gaps between consecutive primes, we are able to construct infinite families of “almost” Ramanujan graphs for ...
متن کامل